On 3-Layer Crossings and Pseudo Arrangements
نویسندگان
چکیده
Let G = (V0; V1 ; V2; E) be a 3-layer graph. The 3-layer drawings of G in which V0 , V1 , and V2 are placed on 3 parallel lines and each edge in E is drawn using one straight line segment, are studied. A generalization of the linear arrangement problem which we call the 3-layer pseudo linear arrangement problem is introduced, and it is shown to be closely related to the 3-layer crossing number. In particular, we show that the 3-layer crossing number of G plus the sum of the square of degrees asymptotically has the same order of magnitude as the optimal solution to the 3-layer linear arrangement problem. Consequently, when G satis-es certain (reasonable) assumptions, we derive the rst polynomial time approximation algorithm to compute the 3-layer crossing number within a multiplicative factor of O(log n) from the optimal.
منابع مشابه
Static and Pseudo Static Study of Stress and Displacement of Earth-Fill Dam Using Layered and Single-Layer Models
Earth-fill dams stability in steady state seepage condition is very important, especially during earthquakes. Numerical software analyses require accurate and realistic modeling of construction stages. Since earth-fill dams are constructed in different layers, so these conditions should be considered in software modeling to achieve a reasonable design. In this study, an earth-fill dam is modele...
متن کاملApplying Crossing Reduction Strategies to Layered Compound Graphs
We present a new method for the application of 2-layer crossing reduction algorithms to layered compound graphs. It is based on an algorithm by Sander [9, 7, 8] and improves it with fewer crossings. Our method is optimal in the sense that it does not introduce unnecessary crossings by itself. If used with an optimal 2-layer crossing reduction algorithm, the crossing reduction for 2-layer compou...
متن کاملArrangements of Pseudocircles: Triangles and Drawings
A pseudocircle is a simple closed curve on the sphere or in the plane. The study of arrangements of pseudocircles was initiated by Grünbaum, who defined them as collections of simple closed curves that pairwise intersect in exactly two crossings. Grünbaum conjectured that the number of triangular cells p3 in digon-free arrangements of n pairwise intersecting pseudocircles is at least 2n−4. We p...
متن کاملReliability Analysis of Switches and Crossings – A Case Study in Swedish Railway
It is reported that switches and crossings (S&C) are one of the subsystems that cause the most delays on Swedish Railways while accounting for at least 13% of maintenance costs. It is the main reason for choosing to base this study on this subsystem. Intelligent data processing allows understanding the real reliability characteristics of the assets to be maintained. The first objective of this...
متن کامل